Counting endpoint sequences for interval orders and interval graphs
نویسندگان
چکیده
منابع مشابه
New Perspectives on Interval Orders and Interval Graphs
Interval orders and interval graphs are particularly natural examples of two widely studied classes of discrete structures: partially ordered sets and undirected graphs. So it is not surprising that researchers in such diverse fields as mathematics, computer science, engineering and the social sciences have investigated structural, algorithmic, enumerative, combinatorial, extremal and even expe...
متن کاملMinimization of Open Orders Using Interval Graphs
In this paper we address an order processing optimization problem known as the Minimization of Open Stacks Problem (MOSP). This problem consists in finding the best sequence for manufacturing the different products required by costumers, in a setting where only one product can be made at a time. The objective is to minimize the maximum number of incomplete orders from costumers that are being p...
متن کاملThe niche graphs of interval orders
The niche graph of a digraph D is the (simple undirected) graph which has the same vertex set as D and has an edge between two distinct vertices x and y if and only if N D (x)∩N + D (y) 6= ∅ or N − D (x)∩ N D (y) 6= ∅, where N + D (x) (resp. N − D (x)) is the set of out-neighbors (resp. in-neighbors) of x in D. A digraph D = (V,A) is called a semiorder (or a unit interval order) if there exist ...
متن کاملInterval orders and dimension
We show that for every interval order X , there exists an integer t so that if Y is any interval order with dimension at least t, then Y contains a subposet isomorphic to X .
متن کاملOn Cayley's formula for counting trees in nested interval graphs
In this paper it is shown that the spectrum of a nested interval graph has a very simple structure. From this result a formula is derived to the number of spanning trees in a nested interval graph; this is a generalization of the Cayley formula.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1993
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90353-u